The Wakeup Problem

نویسندگان

  • Michael J. Fischer
  • Shlomo Moran
  • Steven Rudich
  • Gadi Taubenfeld
چکیده

We study a new problem, the wakeup problem, that seems to be fundamental in distributed computing. We present efficient solutions to the problem and show how these solutions can be used to solve the consensus problem, the leader election problem, and other related problems. The main question we try to answer is, how much memory is needed to solve the wakeup problem? We assume a model that captures important properties of real systems that have been largely ignored by previous work on cooperative problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple Low-Energy Instruction Wakeup Mechanism

Instruction issue consumes a large amount of energy in out of order processors, largely in the wakeup logic. Proposed solutions to the problem require prediction or additional hardware complexity to reduce energy consumption and, in some cases, may have a negative impact on processor performance. This paper proposes a mechanism for instruction wakeup, which uses a multi-block instruction queue ...

متن کامل

Duty-Cycled Wireless Sensor Networks: Wakeup Scheduling, Routing, and Broadcasting

(ABSTRACT) In order to save energy consumption in idle states, low duty-cycled operation is widely used in Wireless Sensor Networks (WSNs), where each node periodically switches between sleeping mode and awake mode. Although efficient toward saving energy, duty-cycling causes many challenges , such as difficulty in neighbor discovery due to asynchronous wakeup/sleep scheduling, time-varying tra...

متن کامل

Faster Deterministic Wakeup in Multiple Access Channels

We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in which no global clock is available: processors have local clocks ticking at the same rate, but each clock starts counting the rounds in the round in which the correspondent processor wakes up. Moreover, the number n of...

متن کامل

Gleaner: Mitigating the Blocked-Waiter Wakeup Problem for Virtualized Multicore Applications

As the number of cores in a multicore node increases in accordance with Moore’s law, the question arises as to what are the costs of virtualized environments when scaling applications to take advantage of larger core counts. While a widely-known cost due to preempted spinlock holders has been extensively studied, this paper studies another cost, which has received little attention. The cost is ...

متن کامل

Sleep & Wakeup Technique Based Clustering Protocol-performance Evaluation in Wireless Sensor Network

In order to achieve data information, the Sensor Node’s should form into small groups as clusters in wireless sensor network. In Multi-hop sensor network, the Base-Station (sink) is might not be considered. That is why, the hot-spot problem may occur in this network. In this paper, we analyze the sleep & wakeup approach, in order to avoid the hot spot (WLAN) problem, which aims to increase the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 1996